Nodes and Loops

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS

The notion of strong arcs in a fuzzy graph was introduced byBhutani and Rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. In Mordeson and Yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.In this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...

متن کامل

Non - global Logarithms at 3 Loops , 4 Loops , 5 Loops and Beyond

We calculate the coefficients of the leading non-global logarithms for the hemisphere mass distribution analytically at 3, 4, and 5 loops at large Nc. We confirm that the integrand derived with the strong-energy-ordering approximation and fixed-order iteration of the Banfi-Marchesini-Syme (BMS) equation agree. Our calculation exploits a hidden PSL(2,R) symmetry associated with the jet direction...

متن کامل

Lecture Notes on Invariants for While Loops and Arbitrary Loops

The previous lecture provided axioms for compositional reasoning about deterministic sequential programs. All the axioms compositionally reduce the truth of a postcondition of a more complex program to a logical combination of postconditions of simpler programs. All axioms? Well, all the axioms but one: those about loops. But putting loops aside for the moment, these axioms completely tell us w...

متن کامل

On Elementary Loops and Proper Loops for Disjunctive Logic Programs

This paper proposes an alternative definition of elementary loops and extends the notion of proper loops for disjunctive logic programs. Different from normal logic programs, the computational complexities of recognizing elementary loops and proper loops for disjunctive programs are coNP-complete. To address this problem, we introduce weaker versions of both elementary loops and proper loops an...

متن کامل

BOL LOOPS AND BRUCK LOOPS OF ORDER pq

Right Bol loops are loops satisfying the identity ((zx)y)x = z((xy)x), and right Bruck loops are right Bol loops satisfying the identity (xy)−1 = x−1y−1. Let p and q be odd primes such that p > q. Advancing the research program of Niederreiter and Robinson from 1981, we classify right Bol loops of order pq. When q does not divide p−1, the only right Bol loop of order pq is the cyclic group of o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific American

سال: 1900

ISSN: 0036-8733

DOI: 10.1038/scientificamerican02101900-84a